On Enhancing Security for Division Homomorphism with ElGamal
نویسندگان
چکیده
Secure auctions and machine learning in cloud increasingly employs multi-party homomorphic encryption support.A modification to Elgamal public key cryptosystem was shown enable division using an encoding of plaintext as fractions with numerator denominator encrypted separately. However we notice that unlike for other cryptography schemes, the obtained homomorphism allows retrieval input secrets from result division. Since this cancels benefit encryption, propose introduction a masking operation based on random factors discuss its success operations Zp Q.
منابع مشابه
On CCA1-Security of Elgamal And Damgård’s Elgamal
We establish the complete complexity landscape surrounding CCA1-security of Elgamal and Damgård’s Elgamal (DEG). Denote by X [i] the assumption that the adversary, given a non-adaptive oracle access to the Y oracle with i free variables cannot break the assumption X . We show that the CCA1-security of Elgamal is equivalent to the DDH assumption. We then give a simple alternative to Gjøsteen’s p...
متن کاملOn the CCA1-Security of Elgamal and Damgård's Elgamal
It is known that there exists a reduction from the CCA1security of Damg̊ard’s Elgamal (DEG) cryptosystem to what we call the ddh assumption. We show that ddh is unnecessary for DEGCCA1, while DDH is insufficient for DEG-CCA1. We also show that CCA1-security of the Elgamal cryptosystem is equivalent to another assumption ddh, while we show that ddh is insufficient for Elgamal’s CCA1-security. Fin...
متن کاملOn the Security of ElGamal Based Encryption
The ElGamal encryption scheme has been proposed several years ago and is one of the few probabilistic encryption schemes. However, its security has never been concretely proven based on clearly understood and accepted primitives. Here we show directly that the decision Diffie-Hellman assumption implies the security of the original ElGamal encryption scheme (with messages from a subgroup) withou...
متن کاملA new security proof for Damgård's ElGamal
We provide a new security proof for a variant of ElGamal proposed by Damg̊ard, showing that it is secure against non-adaptive chosen ciphertext. Unlike previous security proofs for this cryptosystem, which rely on somewhat problematic assumptions, our computational problem is similar to accepted problems such the Gap and Decision Diffie-Hellman problems.
متن کاملSecurity of Signed ElGamal Encryption
Assuming a cryptographically strong cyclic group G of prime order q and a random hash function H, we show that ElGamal encryption with an added Schnorr signature is secure against the adaptive chosen ciphertext attack, in which an attacker can freely use a decryption oracle except for the target ciphertext. We also prove security against the novel one-more-decyption attack. Our security proofs ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... International Florida Artificial Intelligence Research Society Conference
سال: 2023
ISSN: ['2334-0762', '2334-0754']
DOI: https://doi.org/10.32473/flairs.36.133266